package com.wfm.leetcode.editor.cn;
public class P剑指OfferII095最长公共子序列{
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int m =text1.length();
        int n = text2.length();
        int[][] dp = new int[m+1][n+1];
        for (int j = 0; j < n; j++) {
            dp[0][j]=0;
        }
        for (int i = 0; i < m; i++) {
            dp[i][0]=0;
        }
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n ; j++) {
                if(text1.charAt(i-1)==text2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else {
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) { 
        Solution solution = new P剑指OfferII095最长公共子序列().new Solution();
    }
}